Finding Faster Configurations Using FLASH
نویسندگان
چکیده
منابع مشابه
Finding Faster Configurations using FLASH
Finding good configurations for a software system is often challenging since the number of configuration options can be large. Software engineers often make poor choices about configuration or, even worse, they usually use a sub-optimal configuration in production, which leads to inadequate performance. To assist engineers in finding the (near) optimal configuration, this paper introduces FLASH...
متن کاملFinding Acceptable Solutions Faster Using Inadmissible Information
Bounded suboptimal search algorithms attempt to find a solution quickly while guaranteeing that the cost does not exceed optimal by more than a desired factor. These algorithms generally use a single admissible heuristic both for guidance and guaranteeing solution quality. We present a new approach to bounded suboptimal search that separates these roles, consulting multiple sources of potential...
متن کاملUsing Monotonicity to Find Optimal Process Configurations Faster
Configurable process models can be used to encode a multitude of (different) process models. After configuration, they can be used to support the execution of a particular process. A configurable process model represents a space of instantiations (configured process variants). Such an instantiation space can be used by an organisation to select the best instantiation(s) according to some Key Pe...
متن کاملFinding Outbreaks Faster
Rapid detection, reporting, and response to an infectious disease outbreak are critical to prevent localized health events from emerging as pandemic threats. Metrics to evaluate the timeliness of these critical activities, however, are lacking. Easily understood and comparable measures for tracking progress and encouraging investment in rapid detection, reporting, and response are sorely needed...
متن کاملFLASH: A Faster Optimizer for SBSE Tasks
Most problems in search-based software engineering involves balancing conflicting objectives. Prior approaches to this task have required a large number of evaluations– making them very slow to execute and very hard to comprehend. To solve these problems, this paper introduces FLASH, a decisiontree based optimizer that incrementally grows one decision tree per objective. These trees are then us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2020
ISSN: 0098-5589,1939-3520,2326-3881
DOI: 10.1109/tse.2018.2870895